An Improved Bound on (A+A)/(A+A)
نویسنده
چکیده
We show that, for a finite set A of real numbers, the size of the set A + A A + A = { a + b c + d : a, b, c, d ∈ A, c + d 6= 0 } is bounded from below by ∣∣∣∣A + A A + A ∣∣∣∣ |A|2+1/4 |A/A|1/8 log |A| . This improves a result of Roche-Newton (2016).
منابع مشابه
Improved Cramer-Rao Inequality for Randomly Censored Data
As an application of the improved Cauchy-Schwartz inequality due to Walker (Statist. Probab. Lett. (2017) 122:86-90), we obtain an improved version of the Cramer-Rao inequality for randomly censored data derived by Abdushukurov and Kim (J. Soviet. Math. (1987) pp. 2171-2185). We derive a lower bound of Bhattacharya type for the mean square error of a parametric function based on randomly censor...
متن کاملAn improved approach for ranking the candidates in a voting system based on efficiency intervals
This paper proposes improvements and revisions to a recent approach in a voting system, and provides an effective approach with a stronger discriminate power. For this purpose, the advantage of a linear transformation is utilized to redene a previously used concept of virtual worst candidate, by incorporating the existing weight restrictions. Then, the best score of this virtual candidate is us...
متن کاملAn improved infeasible interior-point method for symmetric cone linear complementarity problem
We present an improved version of a full Nesterov-Todd step infeasible interior-point method for linear complementarityproblem over symmetric cone (Bull. Iranian Math. Soc., 40(3), 541-564, (2014)). In the earlier version, each iteration consisted of one so-called feasibility step and a few -at most three - centering steps. Here, each iteration consists of only a feasibility step. Thus, the new...
متن کاملOn trees attaining an upper bound on the total domination number
A total dominating set of a graph $G$ is a set $D$ of vertices of $G$ such that every vertex of $G$ has a neighbor in $D$. The total domination number of a graph $G$, denoted by $gamma_t(G)$, is~the minimum cardinality of a total dominating set of $G$. Chellali and Haynes [Total and paired-domination numbers of a tree, AKCE International ournal of Graphs and Combinatorics 1 (2004), 6...
متن کاملA Study of Precision Forging of Steel Spur Gears: Upper Bound Model and Experiments
Precision forging process is widely used for the production of spur gears due to its advantages such as improved strength and surface finish, little waste of materials and reduction in the machining time of the gear. An important aspect of precision forging process is the load required to perform the process successfully and design the forging tools. In this research, a new kinematically admiss...
متن کاملAUTOMATED SIZING OF TRUSS STRUCTURES USING A COMPUTATIONALLY IMPROVED SOPT ALGORITHM
The present study attempts to apply an efficient yet simple optimization (SOPT) algorithm to optimum design of truss structures under stress and displacement constraints. The computational efficiency of the technique is improved through avoiding unnecessary analyses during the course of optimization using the so-called upper bound strategy (UBS). The efficiency of the UBS integrated SOPT algori...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 23 شماره
صفحات -
تاریخ انتشار 2016